Loop Invariants Elimination for Definite Iterations over Unchangeable Data Structures in C Programs
نویسندگان
چکیده
منابع مشابه
Finding Polynomial Loop Invariants for Probabilistic Programs
Quantitative loop invariants are an essential element in the verification of probabilistic programs. Recently, multivariate Lagrange interpolation has been applied to synthesizing polynomial invariants. In this paper, we propose an alternative approach. First, we fix a polynomial template as a candidate of a loop invariant. Using Stengle’s Positivstellensatz and a transformation to a sum-of-squ...
متن کاملDetecting loop-carried dependences in programs with dynamic data structures
The problem of data dependences detection in codes based on dynamic data structures, is crucial to various compiler optimizations. The approach presented in this paper focus on detecting data dependences induced by heap-directed pointers on loops that access dynamic data structures. Knowledge about the shape of the data structure accessible from a heap-directed pointer, provides critical inform...
متن کاملElimination of Local Variables from Definite Logic Programs
In logic programming, a variable is said to be local if it occurs in a clause body but not in its head atom. It is well-known that local variables are the main cause of inefficiency (sometimes even incompleteness) in negative goal computation. The problem is twofold. First, the negation of a clause body that contains a local variables is not expressible without universal quantification, whereas...
متن کاملLoop Patterns in C Programs
Loop statements are an indispensable construct to express repetition in imperative programming languages. At the same time, their ability to express indefinite iteration entails undecidable problems, as famously demonstrated by Turing’s work on the halting problem. Due to these theoretic limitations, efficacy of a termination procedure can only be demonstrated on practical problems – by Rice’s ...
متن کاملAutomatically Generating Loop Invariants Using Quantifier Elimination∗† –Preliminary Report–
An approach for automatically generating loop invariants using quantifier-elimination is proposed. An invariant of a loop is hypothesized as a parameterized formula. Parameters in the invariant are discovered by generating constraints on the parameters by ensuring that the formula is indeed preserved by the execution path corresponding to every basic cycle of the loop. The parameterized formula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modeling and Analysis of Information Systems
سال: 2016
ISSN: 2313-5417,1818-1015
DOI: 10.18255/1818-1015-2015-6-773-782